Face Recognition by Face Bunch Graph Method
نویسندگان
چکیده
Face Bunch Graph method method uses a simple comparison function both for the localization and the recognition of faces. The input data for the two processes are so-called Jets, which represent image properties in the neighbourhood of a face bunch graph (FBG) node. The algorithm described below was chosen for implementation because of its very good results and because of the application of the same representation for both searching for and comparing images. Key-Words: Face Bunch Graph, recognition, Jets, algorithm, Gabor wavelet, similarity function
منابع مشابه
A Face Recognition Method Based on Local Feature Analysis
Elastic Bunch Graph Matching has been proved effective for face recognition. But the recognition procedure needs large computation. Here we present an automatic face recognition method based on local feature analysis. The local features are firstly located by the face structure knowledge and gray level distribution information, rather than searching on the whole image as it does in Elastic Bunc...
متن کاملAverage Half Face Recognition by Elastic Bunch Graph Matching Based on Distance Measurement
Average-half-face experiments the overall accuracy of the system is better than using the original full face image. Clearly experiment shows that half face data produces higher recognition accuracy [5]. The average-half-face contain the data exactly half of the full face and thus results in storage and computational time saving. The information stored in average-half-face may be more discrimina...
متن کاملFace Recognition by Extending Elastic Bunch Graph Matching with Particle Swarm Optimization
Elastic Bunch Graph Matching is one of the well known methods proposed for face recognition. In this work, we propose several extensions to Elastic Bunch Graph Matching and its recent variant Landmark Model Matching. We used data from the FERET database for experimentations and to compare the proposed methods. We apply Particle Swarm Optimization to improve the face graph matching procedure in ...
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کاملTwo Kinds of Statistics for Better Face Recognition
We briefly review the base techniques of elastic graph matching [1] and elastic bunch graph matching [2], which provide a method for face detection, matching, comparison, and identity decision. We then present a method that combines the advantages of Gabor-labeled graphs with maximum likelihood decision making. The improvements over pure bunch graph matching have been studied, and the method ha...
متن کامل